Algebraic Multilevel Preconditioners for the Graph Laplacian Based on Matching in Graphs
نویسندگان
چکیده
منابع مشابه
Algebraic Multilevel Preconditioners for the Graph Laplacian Based on Matching in Graphs
This paper presents estimates of the convergence rate and complexity of an algebraic multilevel preconditioner based on piecewise constant coarse vector spaces applied to the graph Laplacian. A bound is derived on the energy norm of the projection operator onto any piecewise constant vector space, which results in an estimate of the two-level convergence rate where the coarse level graph is obt...
متن کاملAlgebraic Multilevel Preconditioners with Aggregations
Multilevel preconditioners can be used for solving systems arising from discretization of boundary value problems by the finite element method. Standard multilevel preconditioners use a hierarchy of nested finite element grids and corresponding finite element spaces. In some situations, it can be difficult or impossible to create such hierarchies. In these cases, it is still possible to constru...
متن کاملAlgebraic multilevel preconditioners with projectors∗
A new multilevel algebraic preconditioner for symmetric positive definite matrices is proposed. The projection and smoothing steps typical for textbook multigrids are replaced by a special coarsening algorithm which is based on orthogonal projectors onto kernels of subdomain matrices. The preconditioner is compared numerically with a few other multigrid preconditioners.
متن کاملSome Convergence Estimates For Algebraic Multilevel Preconditioners
We discuss the construction of algebraic multilevel preconditioners for the conjugate gradient method and derive explicit and sharp bounds for the convergence rates. We present several numerical examples that demonstrate the efficiency of the preconditioner. sparse approximate inverse, sparse matrix, algebraic multilevel method, preconditioning, conjugate gradient method, Krylov subspace method...
متن کاملHybrid F-cycle Algebraic Multilevel Preconditioners
We consider an algebraic derivation of multilevel preconditioners which are based on a sequence of finite element stiffness matrices. They correspond to a sequence of triangulations obtained by successive refinement and the associated finite element discretizations of second-order selfadjoint elliptic boundary value problems. The stiffness matrix at a given discretization level is partitioned i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 2013
ISSN: 0036-1429,1095-7170
DOI: 10.1137/120876083